159 research outputs found

    Efficient fault-tolerant quantum computing

    Full text link
    Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible quantum codes are obtained, and good candidates exhibited. This permits a new analysis of the permissible error rates and minimum overheads for robust quantum computing. It is found that, under the standard noise model of ubiquitous stochastic, uncorrelated errors, a quantum computer need be only an order of magnitude larger than the logical machine contained within it in order to be reliable. For example, a scale-up by a factor of 22, with gate error rate of order 10510^{-5}, is sufficient to permit large quantum algorithms such as factorization of thousand-digit numbers.Comment: 21 pages plus 5 figures. Replaced with figures in new format to avoid problem

    Quantum Teleportation is a Universal Computational Primitive

    Get PDF
    We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell measurements, and GHZ states. We also present straightforward constructions of a wide variety of fault-tolerant quantum gates.Comment: 6 pages, REVTeX, 6 epsf figure

    Quantum Computing with Very Noisy Devices

    Full text link
    In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices called ``gates'' that tend to destroy the fragile quantum states needed for computation. The goal of fault-tolerant quantum computing is to compute accurately even when gates have a high probability of error each time they are used. Here we give evidence that accurate quantum computing is possible with error probabilities above 3% per gate, which is significantly higher than what was previously thought possible. However, the resources required for computing at such high error probabilities are excessive. Fortunately, they decrease rapidly with decreasing error probabilities. If we had quantum resources comparable to the considerable resources available in today's digital computers, we could implement non-trivial quantum computations at error probabilities as high as 1% per gate.Comment: 47 page

    From quantum fusiliers to high-performance networks

    Full text link
    Our objective was to design a quantum repeater capable of achieving one million entangled pairs per second over a distance of 1000km. We failed, but not by much. In this letter we will describe the series of developments that permitted us to approach our goal. We will describe a mechanism that permits the creation of entanglement between two qubits, connected by fibre, with probability arbitrarily close to one and in constant time. This mechanism may be extended to ensure that the entanglement has high fidelity without compromising these properties. Finally, we describe how this may be used to construct a quantum repeater that is capable of creating a linear quantum network connecting two distant qubits with high fidelity. The creation rate is shown to be a function of the maximum distance between two adjacent quantum repeaters.Comment: 2 figures, Comments welcom

    Quantum optical coherence can survive photon losses: a continuous-variable quantum erasure correcting code

    Get PDF
    A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code (QECC) that robustly protects the involved fragile quantum states from their environment. Just as classical error-correcting codes are indispensible in today's information technologies, it is believed that QECC will play a similarly crucial role in tomorrow's quantum information systems. Here, we report on the first experimental demonstration of a quantum erasure-correcting code that overcomes the devastating effect of photon losses. Whereas {\it errors} translate, in an information theoretic language, the noise affecting a transmission line, {\it erasures} correspond to the in-line probabilistic loss of photons. Our quantum code protects a four-mode entangled mesoscopic state of light against erasures, and its associated encoding and decoding operations only require linear optics and Gaussian resources. Since in-line attenuation is generally the strongest limitation to quantum communication, much more than noise, such an erasure-correcting code provides a new tool for establishing quantum optical coherence over longer distances. We investigate two approaches for circumventing in-line losses using this code, and demonstrate that both approaches exhibit transmission fidelities beyond what is possible by classical means.Comment: 5 pages, 4 figure

    Silicon-based spin and charge quantum computation

    Full text link
    Silicon-based quantum-computer architectures have attracted attention because of their promise for scalability and their potential for synergetically utilizing the available resources associated with the existing Si technology infrastructure. Electronic and nuclear spins of shallow donors (e.g. phosphorus) in Si are ideal candidates for qubits in such proposals due to the relatively long spin coherence times. For these spin qubits, donor electron charge manipulation by external gates is a key ingredient for control and read-out of single-qubit operations, while shallow donor exchange gates are frequently invoked to perform two-qubit operations. More recently, charge qubits based on tunnel coupling in P2+_2^+ substitutional molecular ions in Si have also been proposed. We discuss the feasibility of the building blocks involved in shallow donor quantum computation in silicon, taking into account the peculiarities of silicon electronic structure, in particular the six degenerate states at the conduction band edge. We show that quantum interference among these states does not significantly affect operations involving a single donor, but leads to fast oscillations in electron exchange coupling and on tunnel-coupling strength when the donor pair relative position is changed on a lattice-parameter scale. These studies illustrate the considerable potential as well as the tremendous challenges posed by donor spin and charge as candidates for qubits in silicon.Comment: Review paper (invited) - to appear in Annals of the Brazilian Academy of Science

    Quantum Non-demolition Detection of Single Microwave Photons in a Circuit

    Get PDF
    Thorough control of quantum measurement is key to the development of quantum information technologies. Many measurements are destructive, removing more information from the system than they obtain. Quantum non-demolition (QND) measurements allow repeated measurements that give the same eigenvalue. They could be used for several quantum information processing tasks such as error correction, preparation by measurement, and one-way quantum computing. Achieving QND measurements of photons is especially challenging because the detector must be completely transparent to the photons while still acquiring information about them. Recent progress in manipulating microwave photons in superconducting circuits has increased demand for a QND detector which operates in the gigahertz frequency range. Here we demonstrate a QND detection scheme which measures the number of photons inside a high quality-factor microwave cavity on a chip. This scheme maps a photon number onto a qubit state in a single-shot via qubit-photon logic gates. We verify the operation of the device by analyzing the average correlations of repeated measurements, and show that it is 90% QND. It differs from previously reported detectors because its sensitivity is strongly selective to chosen photon number states. This scheme could be used to monitor the state of a photon-based memory in a quantum computer.Comment: 5 pages, 4 figures, includes supplementary materia

    Bang-bang control of fullerene qubits using ultra-fast phase gates

    Full text link
    Quantum mechanics permits an entity, such as an atom, to exist in a superposition of multiple states simultaneously. Quantum information processing (QIP) harnesses this profound phenomenon to manipulate information in radically new ways. A fundamental challenge in all QIP technologies is the corruption of superposition in a quantum bit (qubit) through interaction with its environment. Quantum bang-bang control provides a solution by repeatedly applying `kicks' to a qubit, thus disrupting an environmental interaction. However, the speed and precision required for the kick operations has presented an obstacle to experimental realization. Here we demonstrate a phase gate of unprecedented speed on a nuclear spin qubit in a fullerene molecule (N@C60), and use it to bang-bang decouple the qubit from a strong environmental interaction. We can thus trap the qubit in closed cycles on the Bloch sphere, or lock it in a given state for an arbitrary period. Our procedure uses operations on a second qubit, an electron spin, in order to generate an arbitrary phase on the nuclear qubit. We anticipate the approach will be vital for QIP technologies, especially at the molecular scale where other strategies, such as electrode switching, are unfeasible

    Architecture for a large-scale ion-trap quantum computer

    Full text link
    Among the numerous types of architecture being explored for quantum computers are systems utilizing ion traps, in which quantum bits (qubits) are formed from the electronic states of trapped ions and coupled through the Coulomb interaction. Although the elementary requirements for quantum computation have been demonstrated in this system, there exist theoretical and technical obstacles to scaling up the approach to large numbers of qubits. Therefore, recent efforts have been concentrated on using quantum communication to link a number of small ion-trap quantum systems. Developing the array-based approach, we show how to achieve massively parallel gate operation in a large-scale quantum computer, based on techniques already demonstrated for manipulating small quantum registers. The use of decoherence-free subspaces significantly reduces decoherence during ion transport, and removes the requirement of clock synchronization between the interaction regions.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/62880/1/nature00784.pd

    An Open-System Quantum Simulator with Trapped Ions

    Full text link
    The control of quantum systems is of fundamental scientific interest and promises powerful applications and technologies. Impressive progress has been achieved in isolating the systems from the environment and coherently controlling their dynamics, as demonstrated by the creation and manipulation of entanglement in various physical systems. However, for open quantum systems, engineering the dynamics of many particles by a controlled coupling to an environment remains largely unexplored. Here we report the first realization of a toolbox for simulating an open quantum system with up to five qubits. Using a quantum computing architecture with trapped ions, we combine multi-qubit gates with optical pumping to implement coherent operations and dissipative processes. We illustrate this engineering by the dissipative preparation of entangled states, the simulation of coherent many-body spin interactions and the quantum non-demolition measurement of multi-qubit observables. By adding controlled dissipation to coherent operations, this work offers novel prospects for open-system quantum simulation and computation.Comment: Pre-review submission to Nature. For an updated and final version see publication. Manuscript + Supplementary Informatio
    corecore